منابع مشابه
Wait!!! No Steroids for this Asthma…
BACKGROUND Strongyloides stercoralis (SS) is a parasite seen in certain parts of the USA and in people from other endemic areas. In these patients steroids might precipitate or exacerbate asthma. Apart from worsening of asthma, serious complications like hyperinfection syndrome and even death can occur in these patients if treated with steroids. Treatment is either ivermectin or albendazole bas...
متن کاملSolving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملTime and Tide Wait for No Diagram
Time plays an important role in some application domains, and can be quite difficult to deal with in diagrams. This is not only true for temporal uncertainty, but also for periodic events. We compare nine different representations that include a notion of time or that are mainly used for temporal information: Time Lines/LifeLines, AsbruView, Ganttand PERT-Charts, Shinkansen timetables, Temporal...
متن کاملNo-wait flexible flowshop scheduling with no-idle machines
This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds. © 2004 Elsevier B.V. All rights reserved.
متن کاملMinimizing Makespan in No-Wait Job Shops
In this paper we study polynomial time approximation schemes (PTASes) for the no-wait job shop scheduling problem with the makespan objective function. It is known that the problem is MaxSNP-hard in the case when each job is allowed to have three operations or more. We show that if each job has at most two operations, the problem admits a PTAS if the number of machines is a constant (i.e., not ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Case Reports
سال: 2015
ISSN: 1941-5923
DOI: 10.12659/ajcr.893729